Phase retrieval algorithm for generation of constant time envelope with prescribed fourier transform magnitude signal

ABSTRACT

The invention is an iterative process for performing iteratively the phase retrieval of an adaptive signal x(t) matching two sets of constraint both concerning the time envelope ue(t) of signal x(t) and magnitude distribution Um(f) of its spectral representation. At each iteration k the process computes an estimate {tilde over (x)}k(t) of signal x(t) which is obtained from a first projection PA on a first set of constraint in time domain of a computed value xk(t) of x(t), xk(t) deriving from an estimate {tilde over (X)}k−1(f) of the spectrum of signal x(t), said estimate {tilde over (X)}k−1(f) being itself obtained from a second projection PB on a second set of constraints in spectral domain of the Fourier transform Xk(f) of the estimate {tilde over (x)}k−1(t) of x(t) computed at iteration k−1. Iterative computation of estimate {tilde over (x)}k(t) is repeated until {tilde over (x)}k(t) meets a predefined criterion which indicates that estimate {tilde over (x)}k(t) is close enough to expected signal x(t).

CROSS REFERENCE TO RELATED APPLICATIONS

This application is the National Stage of International Application No. PCT/IB2013/003217, having an International Filing Date of 11 Dec. 2013, which designated the United States of America, and which International Application was published under PCT Article 21(2) as WO Publication No. 2015/087107 A1, the disclosure of which is incorporated herein by reference in its entirety.

BACKGROUND

1. Field

The presently disclosed embodiment relates to the general field of the generation of radio signals under constraints. It relates more particularly to the field of adaptive radar emissions

2. Brief Description of Related Developments

With the advent of adaptive synthesis of transmit waveforms in radar and sonar, the problem of reconstructing signals with constant temporal envelope with prescribed Fourier transform has become of a prime importance.

In a known manner, a radar system is considered adaptive if one or more of its transmission and/or reception parameters are altered based on the operating environment.

The adaptation of transmit waveform has sparked considerable interest in recent times owing to the considerable performance benefit it can provide.

However, for maximum efficiency, the power amplifier of the radar is usually operated at saturation, which requires a temporal signal with a constant envelope. That's why the reconstruction of a constant envelope signal from the optimized transmission waveform of adaptive radar becomes an important subject of study.

From a mathematical point of view the formulation of the technical problem of the reconstruction of a transmission signal with a time constant envelope taking into account some given spectral constraints involves determining two functions U_(m)(f) and u_(e)(t) that satisfy the following equation: U _(m)(f)e ^(jθ(f)) =F{u _(e)(t)e ^(jϕ(t))}  [1]

where F{.} denotes Fourier transform operation.

The function u_(e)(t)e^(jϕ(t)) describes the complex modulation of the transmission signal x(t), where u_(e)(t) specifies the time-envelope of the waveform, which due to the radar system constraints must be a constant, say “A”.

The Fourier transform of u_(e)(t)e^(jϕ(t)) is denoted as U_(m)(f)e^(jθ(f)). Then, expressing relation [1] otherwise, u_(e)(t)e^(jϕ(t)) can be defined by the following relation: u _(e)(t)e ^(jϕ(t))=∫_(−∞) ^(∞) U _(m)(f)e ^(j(θ(f)+2πft)) df  [2]

Most of the adaptive transmit waveform solutions specify the modulus of the Fourier spectra, U_(m)(f). The problem of finding θ(f) and/or ϕ(t), which meets both the desired time envelope constraint, u_(e)(t) and the desired Fourier modulus spectra, U_(m)(f) is called phase retrieval.

The question that arises here is to determine if it is possible to specify time envelope u_(e)(t) and Fourier spectra U_(m)(f) of a given signal independently, considering that the Fourier transform operation does seem to pose some constraint on the modulus of the Fourier pairs.

However, in a known manner, insofar as the time-bandwidth product of the signal becomes large, the bearing of each of the moduli of its Fourier pairs, u_(e)(t) and U_(m)(f), on the other one, tends to lose force.

To answer this question, several iterative known solutions have been proposed in the literature. One of the earliest is Gerchberg-Saxton algorithm (GSA), which is considered as a special case of Error Reduction Algorithm (ERA).

Based on ERA framework other general algorithms based on steepest-descent/conjugate-gradient, have also been proposed in literature.

Also, basic input-output (BIO) algorithm and Hybrid input-output (HIO) algorithms have been studied.

However, such alternating projection iterative algorithms usually suffer from slow convergence, convergence stagnation, permutation and scaling ambiguities, and sensitivity to initial seed (i.e. initial conditions).

U.S. Pat. No. 8,050,880 which is entitled “Generation of a constant envelope signal” formulates the problem of constant envelope radar signal with prescribed Fourier Transform Magnitude (FTM) in the alternating projection framework. It also outlines the fact that different starting points for the iterative algorithm gives rise to different solutions and their accuracy can be adjusted using a monotonic error criterion.

SUMMARY

One aim of the presently disclosed embodiment is to propose an iterative solution to answer this question, which does not show the aforementioned drawbacks.

To this purpose, the object of the presently disclosed embodiment is a process for performing iteratively the phase retrieval of an adaptive signal x(t) matching two sets of constraint both concerning the time envelope u_(e)(t) of signal x(t) and magnitude distribution Um(f) of its spectral representation, said process computing at each iteration k an estimate {tilde over (x)}_(k)(t) of signal x(t). According to the presently disclosed embodiment the said estimate {tilde over (x)}_(k)(t) is obtained from a first projection P_(A) on a first set of constraint in time domain of a computed value x_(k)(t) of x(t) which derives from an estimate {tilde over (X)}_(k−1)(f) of the spectrum of signal x(t). Said estimate {tilde over (X)}_(k−1)(f) is itself obtained from a second projection P_(B) on a second set of constraints in spectral domain of the Fourier transform X_(k)(f) of the estimate {tilde over (x)}_(k−1)(t) of x(t) computed at iteration k−1. Estimate {tilde over (x)}_(k)(t) is a weighted sum of projection P_(A) of x_(k)(t) onto the first constraint domain and of x_(k)(t) itself; and estimate {tilde over (X)}_(k−1)(f) is a weighted sum of projection P_(B) of X_(k)(f) onto the second constraint domain and of X_(k)(f) itself. The iterative computation of estimate {tilde over (x)}_(k)(t) is repeated until {tilde over (x)}_(k)(t) meats a predefined criterion.

According to an aspect of the presently disclosed embodiment, estimates {tilde over (x)}_(k)(t) and {tilde over (X)}_(k−1)(f) are respectively defined by the following relations: {tilde over (x)} _(k)(t)=σP _(A) {x _(k)(t)}+(1−σ)x _(k)(t), and {tilde over (X)} _(k)(f)=μP _(B) {X _(k)(f)}+(1−μ)X _(k)(f),

where σ and μ are relaxation parameter which values are less than 1 and where P_(A) and P_(B) are respectively defined by the following relations:

${P_{A}\left\{ {x_{k}(t)} \right\}} = \left\{ \begin{matrix} {A\; e^{\{{j\;{\phi_{k}{(t)}}}\}}} & {t\; ɛ\; T} \\ {{{x_{k}(t)}}e^{\{{j\;{\phi_{k}{(t)}}}\}}} & {o.w.} \end{matrix} \right.$

where A is the expected constant magnitude of x(t), and

${P_{B}\left\{ {X_{k}(f)} \right\}} = \left\{ \begin{matrix} {{U_{m}(f)}\; e^{\{{j\;{\theta_{k}{(f)}}}\}}} & {f\; ɛ\;\Omega} \\ {{{X_{k}(f)}}e^{\{{j\;{\theta_{k}{(f)}}}\}}} & {o.w.} \end{matrix} \right.$

where U_(m)(f) is the expected Fourier Transform Magnitude U_(m) (f) of signal x(t).

According to a particular aspect the values of relaxation parameters σ and μ are chosen among a set of values extending between 0.7 and 0.9.

According to another aspect of the presently disclosed embodiment, at the first iteration, the computed value x₁(t) of x(t) is computed from an estimate {tilde over (X)}₀(f) of the spectrum of x(t) defined by the following relation: {tilde over (X)}(f)=U _(m)(f)e ^(jθ) ⁰ ^((f))

where U_(m)(f) is the expected Fourier Transform Magnitude U_(m)(f) of signal x(t) and where θ₀ is a particular initial phase defined by the following relation:

${\theta_{0}(f)} = {{{- \frac{2\pi}{A^{2}}}{\int_{- \frac{\Omega}{2}}^{\frac{\Omega}{2}}{\int_{- \frac{\Omega}{2}}^{f}{{U_{m}^{2}(\eta)}\ d\;\eta\ {df}}}}} + c}$

where Ω is the spectral domain of the second constraints set.

According to another aspect of the presently disclosed embodiment, the said process comprises a test step which take place at each iteration to determine if the predefined criterion is met or not.

According to a particular aspect, the test step consists in comparing the value of the estimate {tilde over (x)}_(k)(t) to the value of the previous estimate {tilde over (x)}_(k−1)(t) to determine if the modulus |{tilde over (x)}_(k)(t)−{tilde over (x)}_(k−1)(t)|² is less than a determined threshold δ or not.

According to another particular aspect, the test step consists in comparing the modulus of the Fourier Transform of estimate {tilde over (x)}_(k)(t) to the prescribed Fourier Transform Magnitude of the expected signal x(t), U_(m)(f), to determine if the modulus ∥F{{tilde over (x)}_(k)(t)}|−U_(m)(f)|² is less than a determined threshold δ or not.

According to another particular aspect, the test step consists in comparing the number k of iterations already performed to a predefined maximum number N of iterations, to determine if k is greater than N or not.

According to another particular aspect, for the last few iterations the values of relaxation parameters σ and μ are chosen substantially equal to 1.

According to another aspect of the presently disclosed embodiment, the said process comprises at least the following steps:

-   -   A first initialisation step for inputting the data corresponding         to the desired time envelope u_(e)(t) as well as those         corresponding to the spectral magnitude components Um(f) of its         spectrum;     -   a second initialization step for consists in computing an         initial seed value θ₀(f) for computing the Fourier transform of         the desired signal x(t);     -   a third initialization step for computing a first estimate         {tilde over (X)}₀(f) of the spectral representation of the         desired transmission signal x(t), {tilde over (X)}₀(f) being         defined by the following relation:         {tilde over (X)} ₀(f)=U _(m)(f)e ^(jθ) ⁰ ^((f)) ∀f;     -   a fourth step for computing the current value x_(k)(t), for an         iteration k, of the desired transmission signal x(t) using an         estimate value {tilde over (X)}_(k−1)(f) of the spectral         representation of x(t) obtained for the previous iteration k−1,         x_(k)(t) being defined by the following relation:         x _(k)(t)=F ⁻¹ {{tilde over (X)} _(k−1)(f)}

where F represents the Fourier transform operation;

-   -   a fifth step for performing the projection P₁ of the current         computed value x_(k)(t) of x(t) using projection P_(A) of         x_(k)(t) onto a first constraint set constituted by the single         value A;     -   a sixth step, test step, for comparing the value of {tilde over         (x)}_(k)(t) with these of some predefined criteria to determine         when the considered criterion is matched meaning that the         iterative phase of the process comprising steps four to nine         (14-19) can be stopped;     -   a seventh step for computing the current value x_(k)(f), for an         iteration k, of the Fourier transform of the desired         transmission signal x(t) using the current value {tilde over         (x)}_(k)(t) computed at the fourth step, x_(k)(f) being defined         by the following relation:         X _(k)(f)=F{{tilde over (x)} _(k)(t)}

where F represents the Fourier transform operation;

-   -   an eighth step for performing the projection P₂ of the current         value X_(k)(f) of the Fourier Transform of x(t) using projection         P_(B) of X_(k)(f) onto a second constraint set constituted by         the prescribed Fourier Transform Magnitude U_(m)(f) of the         expected signal.         -   a ninth step for incrementing index k indicating the number             of the current iteration;     -   a tenth step implemented only if the sixth step is successful         during which a signal {tilde over (x)}_(k)(t) substantially         equal to the expected signal x(t) is delivered.

The presently disclosed embodiment which proposes to use stationary phase approximation as the starting point for implementation of an alternated relaxed projections algorithm to solve a problem of phase retrieval of a signal can be used for several different applications in various fields of activity like optics, electron microscopy, radar & sonar signal processing and image processing, etc. . . . .

DESCRIPTION OF THE DRAWINGS

The features and advantages of the presently disclosed embodiment will be better appreciated through the following description, which describes a particular implementation of the process according to the presently disclosed embodiment given as simple non limiting example and which is based on the appended figures which present.

FIG. 1 is a flowchart showing the main steps of the process of the presently disclosed embodiment as implemented;

FIG. 2 is the illustration of an example of use of the process of the presently disclosed embodiment to perform an adaptive radar transmission waveform.

DETAILED DESCRIPTION

As it has been stated previously, for maximum efficiency, the power amplifiers of the radar are usually operated at saturation, which requires a constant envelope time signal for the transmission signal x(t). Hence, the reconstruction of a constant envelope signal from an optimized transmission waveform for adaptive radar becomes necessary.

Thus mathematically, the problem is to find a signal x(t) such that

$\begin{matrix} {{{x(t)}} = \left\{ \begin{matrix} A & {{{if}\mspace{14mu} t} \in T} \\ 0 & {o.w.} \end{matrix} \right.} & \lbrack 3\rbrack \end{matrix}$

and for which the modulus ∥F{x(t)}|−U _(m)(f)|² is minimum over f∈Ω  [4]

Where A is a constant quantity and U_(m)(f) is the prescribed Fourier Transform Magnitude of the expected signal x(t), obtained from the Signal-to-Interference Ratio (SIR) or Signal-to-Noise Ratio (SNR) criteria of the adaptive waveform design.

As illustrated on FIG. 1, the method according to the presently disclosed embodiment comprises several steps. The first three steps 11, 12 and 13 perform the initialization of the process while the six following steps perform the recursive processing part of the method. The final result is finally output at step 20 whereas initial commands are input at step 11.

First initialisation step 11 consists in inputting the data corresponding to the desired time envelope for the transmission signal as well as those corresponding to the spectral magnitude components of its spectrum.

These data are given for particular intervals of time (tϵ(0,T)) and frequency (fϵ(−Ω/2,Ω/2)).

Second initialization step 12 consists in computing an initial seed value θ₀(f) for computing the Fourier transform of the desired signal. The expression of θ₀(f) is determined by making the approximation that the Fourier spectrum of the input signal has a stationary phase. Approximating the Fourier spectrum as a stationary phase signal makes it possible to simplify the Fourier transform relation to one that can be de-coupled and solved as a closed-form expression.

Considering that the frequency signal to have stationary phase, for generation of non-linear frequency modulation waveforms, means considering, as it is the case here, that Derivative of the phase is close to zero only at some discrete stationary frequency points λ, and that the Fourier Transform Magnitude (FTM) varies slowly compared to the phase of the Fourier signal.

As a result of such an approximation the seed phase parameter can advantageously be expressed by the following closed form expression:

$\begin{matrix} {{\theta_{0}(f)} = {{{- \frac{2\pi}{A^{2}}}{\int_{- \frac{\Omega}{2}}^{\frac{\Omega}{2}}{\int_{- \frac{\Omega}{2}}^{f}{{U_{m}^{2}(\eta)}\ d\;\eta\ {df}}}}} + c}} & \lbrack 5\rbrack \end{matrix}$

where Ω represents the spectral domain of the transmission signal x(t).

It can be noted that expression [5] is same expression as that derived in for generation of Non-Linear Frequency Modulated waveforms with defined auto-correlation properties.

Third initialization step 13 consists in computing a first estimate {tilde over (X)}₀(f) of the spectral representation of the desired transmission signal x(t). Taking relation [5] into account {tilde over (X)}₀(f) is defined by the following relation: {tilde over (X)} ₀(f)=U _(m)(f)e ^(jθ) ⁰ ^((f)) ∀f  [6]

Step 14 is the fourth step of the process according to the presently disclosed embodiment and the first iterative step of the iterative phase which comprise steps 14 to 19. The fourth step 14 computes the current value x_(k)(t), for an iteration k, of the desired transmission signal x(t) using an estimate value {tilde over (X)}_(k−1)(f) of the spectral representation of x(t) obtained for the previous iteration k−1. As illustrated on FIG. 1, x_(k)(t) is defined by the following relation: x _(k)(t)=F ⁻¹ {{tilde over (X)} _(k−1)(f)}  [7]

where F represents the Fourier transform operation.

Thus, according to this step, the first computed value x₁(t) of signal x(t) is given by the relation x₁(t)=F⁻¹{{tilde over (X)}₀(f)}=F⁻¹{U_(m)(f)e^(jθ) ⁰ ^((f))}.

Step 15 (fifth step) of the process according to the presently disclosed embodiment performs the projection P₁ of the current computed value x_(k)(t) of x(t) onto a first constraint set constituted by the single value A. According to the presently disclosed embodiment projection P₁ is not a common direct projection, but a relaxed projection defined by the following relation: {tilde over (x)} _(k)(t)=σP _(A) {x _(k)(t)}+(1−σ)x _(k)(t)  [8]

Where σ is a relaxation parameter chosen arbitrarily as being less than 1 and where P_(A) is a projection defined by the following relation:

${P_{A}\left\{ {x_{k}(t)} \right\}} = \left\{ \begin{matrix} {A\; e^{\{{j\;{\phi_{k}{(t)}}}\}}} & {t\; ɛ\; T} \\ {{{x_{k}(t)}}e^{\{{j\;{\phi_{k}{(t)}}}\}}} & {o.w.} \end{matrix} \right.$

where A is the expected constant magnitude of x(t).

The result of such a projection is an estimate value for iteration k of the real value of x(t) which is a weighted sum taking into account both the result of the direct projection of the computed current value x_(k)(t) of x(t) onto the first constraint set and x_(k)(t).

Step 16 (the sixth step) of the process according to the presently disclosed embodiment tests the value of the estimate {tilde over (x)}_(k)(t) to determine whether or not the iterative phase of the process (steps 14-19) can be stopped. According to the presently disclosed embodiment, the test consists in comparing the value of {tilde over (x)}_(k)(t) with these of some criteria:

-   -   In a first preferred aspect the value of the estimate {tilde         over (x)}_(k)(t) is compared to the value of the previous         estimate {tilde over (x)}_(k−1)(t) to determine if the modulus         |{tilde over (x)}_(k)(t)−{tilde over (x)}_(k−1)(t)|² is less         than a determined threshold δ or not. If it is the case then the         criterion is met.     -   In a second preferred aspect the modulus of the Fourier         transform of the estimate {tilde over (x)}_(k)(t) is compared to         the prescribed Fourier Transform Magnitude of the expected         signal x(t), U_(m)(f), to determine if the modulus ∥F{{tilde         over (x)}_(k)(t)}|−U_(m)(f)|² is less than a determined         threshold δ or not. If it is the case then the criterion is met.     -   In a third preferred aspect the number k of iterations already         performed is compared to a determined maximum number N of         iterations, to determine if k is greater than N or not. If it is         the case then the criterion is met.     -   In a fourth preferred aspect each of the tests of the three         previous aspects are performed for each iteration k. Then, if at         one of the previous tests is succeeded, then the criterion is         met.

According to the presently disclosed embodiment, if the considered criterion or criteria are met at step 16, the estimate {tilde over (x)}_(k)(t) is considered as matching the desired signal x(t). The iterative phase of the process then stops and the process ends with step 20 during which {tilde over (x)}_(k)(t) is delivered for use. Reversely, if the considered criterion or criteria are not met at step 16, the iterative phase of the process continues with step 17.

Step 17 (seventh step) of the process according to the presently disclosed embodiment computes the current value X_(k)(f), for an iteration k, of the Fourier transform of the desired transmission signal x(t) using the current value {tilde over (x)}_(k)(t) computed at step 14. As illustrated on FIG. 1, X_(k)(f) is defined by the following relation: X _(k)(f)=F{{tilde over (x)} _(k)(t)}  [9]

where F represents the Fourier transform operation.

Step 18 (eighth step) of the process according to the presently disclosed embodiment performs the projection P_(B) of the current value X_(k)(f) onto a second constraint set constituted by the prescribed Fourier Transform Magnitude U_(m)(f) of the expected signal. According to the presently disclosed embodiment projection P_(B) is not a common direct projection, but a relaxed projection defined by the following relation: {tilde over (X)} _(k)(f)=μP _(B) {X _(k)(f)}+(1−μ)X _(k)(f)  [10]

Where μ is a relaxation parameter chosen arbitrarily as being less than 1.

The result of such a projection is an estimate value for iteration k of the real value of X(f) which is a weighted sum taking into account both the result of the direct projection of the current computed value X_(k)(f) of X(f) onto the first constraint set and X_(k)(f).

Such relaxed projections like these employed in the process according to the presently disclosed embodiment often advantageously improves the rate of convergence, and the incorporation of the non-linearity avoids solution stagnation and instances of limit cycle in several cases

As illustrated on FIG. 1, the iterative phase of the process according to the presently disclosed embodiment thus comprises five computational steps 14 to 18, each iteration beginning with step 19 during which index k is incremented to K+1.

It is worth noting that μ and σ are relaxation parameters chosen arbitrarily in a set of values extending between 0 and 1 and preferably between 0.7 and 0.9. In a preferred aspect μ and σ have fixed values for all iterations. However in case that the number of iterations implemented by the process is limited to a fixed number N, the value of μ and σ parameters could be modified for the last few iterations, and fixed to a value close or even equal to 1, in order to make sure that the final computed value x_(N)(t) of signal x(t) complies the two constraints sets.

As it is described above, the process according to the presently disclosed embodiment advantageously makes it possible to perform a signal x(t) which both responds to a constraint of time envelope and to a constraint of spectrum magnitude distribution. Such a process can be advantageously employed in many fields of activity.

It can be used in particular in adaptive radar design to construct adaptive transmission waveforms. An adaptive radar can suitably tune it's transmit waveform according to its environment and are based on optimization criteria like signal-to-noise ratio, signal-to-interference ratio, mutual information, etc. The use of the process of the presently disclosed embodiment to generate the adaptive transmit waveform advantageously improves the performance of the synthesis in terms of speed convergence increase and of decrease of the normalized mean squared error, compared to non-adaptive initial seed alternating projection methods.

FIG. 2 illustrate an example of use of the process according to the presently disclosed embodiment in a signal adaptive synthesis system.

In such an application the process according to the presently disclosed embodiment takes place in the global waveform generation subsystem 21 which mainly comprises an “environment awareness” processing unit 22 and an adaptive waveform generator 23 in which the process 10 according to the presently disclosed embodiment is integrated.

The processing unit of environmental awareness 22 processes the input (after demodulation) RF signal to determine, in a known manner, the ambiance signal that accompanies useful radar signal. It outputs a constraint information Um(f) which is the distribution pattern of the magnitude (versus frequency) of the transmission signal x(t) to be synthesized. This information is taken into account by the process according to the presently disclosed embodiment which is implemented by the adaptive waveform generator 23 to perform phase retrieval of x(t) assuming that the time envelope of x(t) should be constant. Such operation leads to produce the transmission signal x(t) which is transmitted to transmission subsystem of the adaptive radar equipment. 

What is claimed is:
 1. A process for performing iteratively the phase retrieval of a transmission signal x(t) matching two sets of constraint both concerning the time envelope u_(e)(t) of signal x(t) and magnitude distribution U_(m)(f) of its spectral representation, said process computing at each iteration k an estimate {tilde over (x)}(t) of signal x(t), comprising said estimate {tilde over (x)}_(k)(t) being obtained from a first projection P_(A) on a first set of constraint in time domain of a computed value x_(k)(t) of x(t) which derives from an estimate {tilde over (X)}_(k−1)(f) of the spectrum of signal x(t), said estimate {tilde over (X)}_(k−1)(f) being itself obtained from a second projection P_(B) on a second set of constraints in spectral domain of the Fourier transform X_(k)(f) of the estimate {tilde over (x)}_(k−1)(t) of x(t) computed at iteration k−1; estimate {tilde over (x)}_(k)(t) being a weighted sum of projection P_(A) of x_(k)(t) onto the first constraint domain and of x_(k)(t) itself; estimate {tilde over (X)}_(k−1)(f) being a weighted sum of projection of P_(B) of X_(k)(f) onto the second constraint domain and of X_(k)(f) itself; iterative computation of estimate {tilde over (x)}_(k)(t) is repeated until {tilde over (x)}_(k)(t) meets a predefined criterion, wherein estimates {tilde over (x)}_(k)(t) and {tilde over (X)}_(k−1)(f) are respectively defined by the following relations: {tilde over (x)}(t)=σP _(A) {x _(k)(t)}+(1−σ)x _(k)(t),and {tilde over (X)}(f)=μP _(B) {X _(k)(f)}+(1−μ)X _(k)(f) where σ and μ are relaxation parameter which values are less than 1 and where P_(A) and P_(B) are respectively defined by the following relations: ${P_{A}\left\{ {x_{k}(t)} \right\}} = \left\{ \begin{matrix} {A\; e^{\{{j\;{\phi_{k}{(t)}}}\}}} & {t\; ɛ\; T} \\ {{{x_{k}(t)}}e^{\{{j\;{\phi_{k}{(t)}}}\}}} & {o.w.} \end{matrix} \right.$ where A is the expected constant magnitude of x(t), and ${P_{B}\left\{ {X_{k}(f)} \right\}} = \left\{ \begin{matrix} {{U_{m}(f)}\; e^{\{{j\;{\theta_{k}{(f)}}}\}}} & {f\; ɛ\;\Omega} \\ {{{X_{k}(f)}}e^{\{{j\;{\theta_{k}{(f)}}}\}}} & {o.w.} \end{matrix} \right.$ where U_(m)(f) is the expected Fourier Transform Magnitude U_(m)(f) of signal x(t), and wherein, at the first iteration the computed value x₁(t) of x(t) is computed from an estimate {tilde over (X)}₀(f) of the spectrum of x(t) defined by the following relation: {tilde over (X)} ₀(f)=U _(m)(f)e ^(iθ) ⁰ ^((f)) where Um(f) is the expected Fourier Transform Magnitude U_(m)(f) of signal x(t) and where θ₀ is a particular initial phase defined by the following relation: ${\theta_{0}(f)} = {{{- \frac{2\pi}{A^{2}}}{\int_{- \frac{\Omega}{2}}^{\frac{\Omega}{2}}{\int_{- \frac{\Omega}{2}}^{f}{{U_{m}^{2}(\eta)}\ d\;\eta\ {df}}}}} + c}$ where Ω is the spectral domain of the second constraints set.
 2. The process of claim 1, wherein the values of relaxation parameters σ and μ are chosen among a set of values extending between 0.7 and 0.9.
 3. The process according to claim 1, wherein a test step takes place at each iteration to determine if the predefined criterion is met or not.
 4. The process of claim 3, wherein the test step consists in comparing the value of the estimate {tilde over (x)}_(k)(t) to the value of the previous estimate {tilde over (x)}_(k−1)(t) to determine if the modulus |{tilde over (x)}_(k)(t)−{tilde over (x)}_(k−1)(t)|² is less than a determined threshold δ or not.
 5. The process of claim 3, wherein the test step consists in comparing the modulus of the Fourier Transform of estimate {tilde over (x)}_(k)(t) to the prescribed Fourier Transform Magnitude of the expected signal x(t), U_(m)(f), to determine if the modulus ∥F{{tilde over (x)}_(k)(t)}|−U_(m)(f)|₂ is less than a determined threshold δ or not.
 6. The process of claim 3, wherein the test step consists in comparing the number k of iterations already performed to a predefined maximum number N of iterations, to determine if k is greater than N or not.
 7. The process of claim 6, wherein, for the last few iterations the values of relaxation parameters σ and μ are chosen substantially equal to
 1. 8. The process according to claim 1, comprising at least the following steps: a first initialization step for inputting the data corresponding to the desired time envelope u_(e)(t) as well as those corresponding to the spectral magnitude components U_(m)(f) of its spectrum; a second initialization step for consists in computing an initial seed value θ₀(f) for computing the Fourier transform of the desired signal x(t); a third initialization step for computing a first estimate {tilde over (X)}₀(f) of the spectral representation of the desired transmission signal x(t), {tilde over (X)}₀(f) being defined by the following relation: {tilde over (X)} ₀(f)=U _(m)(f)e ^(i θ) ⁰ ^((f)) ∀f; a fourth step for computing the current value x_(k)(t), for an iteration k, of the desired transmission signal x(t) using an estimate value {tilde over (X)}_(k−1)(t) of the spectral representation of x(t) obtained for the previous iteration k−1, x_(k)(t) being defined by the following relation: x _(k)(t)=F ⁻¹ {{tilde over (X)} _(k−1)(f)} where F represents the Fourier transform operation; a fifth step for performing the projection P₁ of the current computed value x_(k)(t) of x(t) using projection P_(A) of x_(k)(t) onto a first constraint set constituted by the single value A; a sixth step, test step, for comparing the value of {tilde over (x)}_(k)(t) with these of some predefined criteria to determine when the considered criterion is matched meaning that the iterative phase of the process comprising steps four to nine can be stopped; a seventh step for computing the current value X_(k)(f), for an iteration k, of the Fourier transform of the desired transmission signal x(t) using the current value {tilde over (x)}_(k)(t) computed at the fourth step, X_(k)(f) being defined by the following relation: X _(k)(f)=F{{tilde over (x)} _(k)(t)} where F represents the Fourier transform operation; an eighth step performing the projection P₂ of the current value X_(k)(f) of the Fourier Transform of x(t) using projection P_(B) of X_(k)(f) onto a second constraint set constituted by the prescribed Fourier Transform Magnitude U_(m)(f) of the expected signal; a ninth step for incrementing index k indicating the number of the current iteration; a tenth step implemented only if the sixth step (16) is successful during which a signal {tilde over (x)}_(k)(t) substantially equal to the expected signal x(t) is delivered. 